Vertex‐regular 1‐factorizations in infinite graphs
نویسندگان
چکیده
The existence of 1-factorizations an infinite complete equipartite graph K m [ n ] ${K}_{m}[n]$ (with $m$ parts size $n$ ) admitting a vertex-regular automorphism group G $G$ is known only when = 1 $n=1$ and countable (i.e., for graphs) and, in addition, finitely generated abelian order . In this paper, we show that 1-factorization under the exists if has subgroup H $H$ whose index Furthermore, provide sufficient condition Cayley to have regular 1-factorization. Finally, construct contain given subfactorization, both having group.
منابع مشابه
Infinite matroids in graphs
It has recently been shown that infinite matroids can be axiomatized in a way that is very similar to finite matroids and permits duality. This was previously thought impossible, since finitary infinite matroids must have non-finitary duals. In this paper we illustrate the new theory by exhibiting its implications for the cycle and bond matroids of infinite graphs. We also describe their algebr...
متن کاملDuality in Infinite Graphs
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cuts (or cocycles) can be infinite, cycles are finite. We show that these obstructions fall away when duality is reinterpreted on the basis of a ‘singular’ approach to graph homology, whose cycles are defined topologically in a space formed by the graph together with its ends and can be infinite. O...
متن کامل$T$-Joins in Infinite Graphs
We characterize the class of infinite connected graphs G for which there exists a T -join for any choice of an infinite T ⊆ V (G). We also show that the following well-known fact remains true in the infinite case. If G is connected and does not contain a T -join, then it will if we either remove an arbitrary vertex from T or add any new vertex to T .
متن کاملInfinite friendship graphs with infinite parameters
We study infinite graphs in which every set of κ vertices has exactly λ common neighbours. We prove that there exist 2σ such graphs of each infinite order σ if κ is finite and that for κ infinite there are 2λ of them of order λ and none of cardinality greater than λ (assuming the GCH). Further, we show that all a priori admissible chromatic numbers are in fact possible for such graphs.
متن کاملTransitivity conditions in infinite graphs
We study transitivity properties of graphs with more than one end. We completely classify the distance-transitive such graphs and, for all k ≥ 3, the k-CS-transitive such graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Designs
سال: 2022
ISSN: ['1520-6610', '1063-8539']
DOI: https://doi.org/10.1002/jcd.21829